Exploiting Partial Order with Quicksort
نویسنده
چکیده
The widely known Quicksort algorithm does not attempt to actively take advantage of partial order in sorting data. A relatively simple change can be made to the Quicksort strategy to give a bestcase performance of n. for ordered data. with a smooth transition to O(n log n) for the random data case. An attractive attribute of this new algorithm CTransort> Is that its performance for random data matches that for Sedgewlck's claimed best Implementation of Quicksort. EXPLOITING PARTIAL ORDER WITH QUICKSORT
منابع مشابه
The Quicksort algorithm and related topics
Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort algorithm and its variants. Specifically, we study the time complexity of the algorithm and we provide a complete demonstration of the variance of the number of...
متن کاملPartial quicksort and weighted branching processes
In this dissertation we look at different two models of sorting algorithms based on divideand-conquer algorithms. Quicksort algorithm, sort an unsorted array of n distinct elements. Partial Quicksort sorts the l smallest elements in a list of length n. Both stochastic divide-and-conquer algorithms are widely studied. Our algorithm Quicksort on the fly provides online the first smallest, then se...
متن کاملChunksort: A Generalized Partial Sorting Algorithm
We introduce here the problem of generalized partial sorting and chunksort, an algorithm closely related to quicksort and quickselect that solves this problem in an elegant and efficient way. In generalized partial sorting we are given an array of n elements and p intervals I1 = [`1,u1], I2 = [`2,u2], . . . , Ip = [`p,up], which define p blocks in the array and p+1 gaps between the blocks. The ...
متن کاملA Machine-Checked Proof of the Average-Case Complexity of Quicksort in Coq
As a case-study in machine-checked reasoning about the complexity of algorithms in type theory, we describe a proof of the average-case complexity of Quicksort in Coq. The proof attempts to follow a textbook development, at the heart of which lies a technical lemma about the behaviour of the algorithm for which the original proof only gives an intuitive justification. We introduce a general fra...
متن کاملQuicksort with median of medians is considered practical
Quicksort[2, 1, 3] is one of the most efficient and widely used sorting algorithms. The major drawback of quicksort is that worst case time complexity of naive implementations of quicksort is O(n2) with input size n. In order to avoid this worst case behavior, a variant of quicksort, so-called introsort[4] 1 , is often used. There exists another solution to keep the worst case complexity of qui...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Softw., Pract. Exper.
دوره 14 شماره
صفحات -
تاریخ انتشار 1984